Finite-state Representations Embodying Temporal Relations
نویسنده
چکیده
Finite-state methods are applied to the Russell-Wiener-Kamp notion of time (based on events) and developed into an account of interval relations and semi-intervals. Strings are formed and collected in regular languages and regular relations that are argued to embody temporal relations in their various underspecified guises. The regular relations include retractions that reduce computations by projecting strings down to an appropriate level of granularity, and notions of partiality within and across such levels.
منابع مشابه
Linguistic Means of Description of Family Relations in the Novel “In Chancery” By J. Galsworthy
The article is devoted to the study of the evaluative component of the meaning of lexical means used to describe relations between family members in the novel “In Chancery” by J. Galsworthy. The relevance of t &he study can be attributed to the lack of works devoted to this problem. As the results of our study demonstrate, the words of the lexical-semantic group “family” were mainly used to ver...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملInformation Symmetries in Irreversible Processes
We study dynamical reversibility in stationary stochastic processes from an information-theoretic perspective. Extending earlier work on the reversibility of Markov chains, we focus on finitary processes with arbitrarily long conditional correlations. In particular, we examine stationary processes represented or generated by edge-emitting, finite-state hidden Markov models. Surprisingly, we fin...
متن کاملImplicit Representation of Discrete Objects
This tutorial paper discusses the known representations based on Binary Decision Diagrams (BDDs) for various types of discrete objects: incompletely specified functions, sets, finite state machines, binary and multi-valued relations, etc. While presenting the known material, the emphasis is on those aspects of implicit representations that are important to achieve speed-up in computation. The n...
متن کاملRepresentation and Learning of Temporal Relations
Determining the relative order of events and times described in text is an important problem in natural language processing. It is also a difficult one: general state-of-the-art performance has been stuck at a relatively low ceiling for years. We investigate the representation of temporal relations, and empirically evaluate the effect that various temporal relation representations have on machi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011